Restricting EDF migration on uniform heterogeneous multiprocessors
نویسندگان
چکیده
Restricted migration of periodic and sporadic tasks on uniform heterogeneous multiprocessors is considered. Migration between different processors of a multiprocessor causes overhead that may be prohibitively high for real-time systems, where accurate timing is essential. Nonetheless, periodic tasks, which generate jobs at regular intervals, may be able to migrate without causing overhead if the migration can be controlled. In particular, if consecutive jobs of the same task do not share any data then they may be allowed to execute on different processors without incurring migration overhead — i.e., restricted migration may be permitted. On uniform multiprocessors, each processor has an associated speed. A job executing on a processor of speed s for t units of time will perform s× t units of work. A utilization-based test for restricted migration on uniform multiprocessors is presented where each processor schedules jobs using the earliest deadline first (EDF) scheduling algorithm. RÉSUMÉ. Nous considérons des migrations restreintes pour des tâches périodiques et sporadiques pour des plates-formes hétérogènes. Les migrations entre processeurs différents causent une surcharge qui peut potentiellement être importante pour des systèmes temps réel, où la prédictabilité est essentielle. Néanmoins, les tâches périodiques, qui génèrent des travaux à intervalles réguliers, peuvent migrer sans causer une surcharge, si les migrations sont contrôlées. En particulier, si des travaux consécutifs de la même tâche ne partagent pas de données, ils peuvent s’exécuter sur des processeurs différents sans induire une surcharge lors de la migration, c’est-à-dire, qu’une migration restreinte peut être autorisée. Sur des plates-formes uniformes, chaque processeur possède une vitesse. Un travail s’exécutant sur un processeur de vitesse s pendant t unités de temps progressera de s × t unités de travail. Un test orienté utilisation, pour les migrations restreintes et les plates-formes uniformes est présenté où chaque processeur ordonnance les travaux avec la stratégie earliest deadline first (EDF).
منابع مشابه
Restricting EDF migration on uniform multiprocessors
Restricted migration of periodic and sporadic tasks on uniform multiprocessors is considered. On multiprocessors, job migration can cause a prohibitively high overhead — particularly in real-time systems where accurate timing is essential. However, if periodic tasks do not maintain state between separate invocations, different jobs of the same task may be allowed to execute on different process...
متن کاملA New Task Model and Utilization Bound for Uniform Multiprocessors
This paper introduces a new model for describing jobs and tasks for real-time systems. Using this model can improve utilization bounds on uniform multiprocessors, in which each processor has an associated speed. Traditionally, a job executing on a processor of speed s for t units of time will perform s × t units of work. However, this uniform scaling only occurs if tasks are completely CPU boun...
متن کاملRobustness results concerning EDF scheduling upon uniform multiprocessors
Each processor in a uniform multiprocessor machine is characterized by a speed or computing capacity, with the interpretation that a job executing on a processor with speed s for t time units completes ðs tÞ units of execution. The earliestdeadline-first (EDF) scheduling of hard-real-time systems upon uniform multiprocessor machines is considered. It is known that online algorithms tend to perf...
متن کاملModifying EDF for Uniform Multiprocessors
Scheduling real-time systems on multiprocessors introduces complexities that do not arise when using uniprocessors. If the processors do not all operate at the same speed, scheduling becomes even more complex. When scheduling using EDF on multiprocessors, breaking deadline ties in different ways can change the resulting schedule dramatically. We consider methods to resolve the ambiguities in ED...
متن کاملCharacteristics of EDF Schedulability on Uniform Multiprocessors
In uniform multiprocessor platforms, the various processors comprising the multiprocessor platform may have different computing capacities. The focus of this paper is the design of efficient tests for determining whether the Earliest Deadline First Scheduling Algorithm (EDF) can successfully schedule a given real-time task system to meet all deadlines upon a specified uniform multiprocessor pla...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Technique et Science Informatiques
دوره 24 شماره
صفحات -
تاریخ انتشار 2005